Towards recency ranking in web search.
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detects and responds to recency sensitive queries. The system detects recency sensitive queries using a high precision classifier. The system responds to recency sensitive queries by using a machine learned ranking model trained for such queries. We use multiple recency features to provide temporal evidence which effectively represents document recency. Furthermore, we propose several training methodologies important for training recency sensitive rankers. Finally, we develop new evaluation metrics for recency sensitive queries. Our experiments demonstrate the efficacy of the proposed approaches.
Time is of the essence improving recency ranking using Twitter data.

Multi%2Dtask learning for learning to rank in web search.

Multi%2Dtask learning for learning to rank in web search.

On domain similarity and effectiveness of adapting%2Dto%2Drank.

Speech Recognition Method Based on Linear Descending Inertia Weight PSO Algorithm Optimizing SVM Kernel Parameters.

Semantic%2Dbased partial retrieval of CAD models for design reuse.

A Novel Finite%2DElement%2DBased Algorithm for Fluorescence Molecular Tomography of Heterogeneous Media.

The Differences of Mechanical Properties of Femur Using Two Material Assignment Methods Based on CT Data.

Fluorescent Optical Imaging of Small Animals Using Filtered Back%2Dprojection 3D Surface Reconstruction Method.

Adaptive fuzzy clustering in constructing parametric images for low SNR functional imaging.

Investigation of partial query proximity in web search.

Adapting information retrieval to query contexts.

Extending query translation to cross%2Dlanguage query expansion with markov chain models.
Département d&#039;Informatique et de

A Framework for Integrated Optimization of Product Development Process.

Facilitating e%2DBusiness by Retrieving Relevant Business Opportunities on the Internet.


Using Markov Chains to Exploit Word Relationships in Information Retrieval.

Using query contexts in information retrieval.
User query is an element that specifies an information need, but it is not the only one. Studies in literature have found many contextual factors that strongly influence the interpretation of a query. Recent studies have tried to consider the user’s interests by creating a user profile. However, a single profile for a user may not be sufficient for a variety of queries of the user. In this study, we propose to use query-specific contexts instead of user-centric ones, including context around query and context within query. The former specifies the environment of a query such as the domain of interest, while the latter refers to context words within the query, which is particularly useful for the selection of relevant term relations. In this paper, both types of context are integrated in an IR model based on language modeling. Our experiments on several TREC collections show that each of the context factors brings significant improvements in retrieval effectiveness.
Fast and Reliable Estimation of Multiple Parametric Images Using an Integrated Method for Dynamic SPECT.

Multiple Abdominal Organ Segmentation An Atlas%2DBased Fuzzy Connectedness Approach.

A Computational Framework for Approximating Boundary Surfaces in 3%2DD Biomedical Images.

A Digital Model Framework of metabolic System Based on Visible Human Data Set.

Isosurfaces computation for approximating boundary surfaces within three%2Ddimensional images.

Constructing better document and query models with markov chains.

Context%2DDependent Term Relations for Information Retrieval.
Co-occurrence analysis has been used to determine related words or terms in many NLP-related applications such as query expansion in Information Retrieval (IR). However, related words are usually determined with respect to a single word, without relevant information for its application context. For example, the word “programming ” may be considered to be strongly related to “Java”, and applied inappropriately to expand a query on “Java travel”. To solve this problem, we propose to add another context word in the relation to specify the appropriate context of the relation, leading to term relations of the form “(Java, travel)  → Indonesia”. The extracted relations are used for query expansion in IR. Our experiments on several TREC collections show that this new type of context-dependent relations performs much better than the traditional co-occurrence relations. 1.
A Speech Endpoint Detection Method Based on Wavelet Coefficient Variance.

The Speech Recognition Based on the Bark Wavelet and CZCPA Features.

Abdominal Organ Identification Based on Atlas Registration and Its Application in Fuzzy Connectedness Segmentation.

Integrating word relationships into language models.

Inferential language models for information retrieval.

Query expansion using term relationships in language models for information retrieval.

Integrating word relationships into language models.



Properties of Savitzky%2DGolay digital differentiators.

Savitzky%2DGolay smoothing and differentiation filter for even number data.

Web%2Dsupported Matching and Classification of Business.
More and more business opportunities are published on the Web; however, it is difficult to collect and process them automatically. This paper describes a tool and techniques to help users discovering relevant business opportunities, in particular, calls for tenders. The tool includes spidering, information extraction, classification, and a search interface. Our focus in this paper is on classification, which aims to organize calls for tenders into classes, so as to facilitate user’s browsing. We describe a new approach to classification of business opportunities on the Web using language modeling (LM) approach. This utilization is strongly inspired by the recent success of LM in IR experiments. However, few attempts have been made to use LM for text classification so far. Our goal is to investigate whether LM can bring improvement to text classification. Our experiments are conducted on two corpora: Reuters containing newswire articles and FedBizOpps (FBO) containing calls for tenders (CFTs) published on the Web. The experimental results show that LM-based classification can significantly improve the classification performance on both test corpora, compared with the traditional Naïve Bayes (NB) classifier. In particular, it seems to have stronger impact on FBO than on Reuters. This result shows that LM can greatly improve classification on the Web.
Finger Sculpting with Digital Clay 3D Shape Input and Output through a Computer%2DControlled Real Surfac.
The NSF Digital Clay project is focused on the design, prototyping, integration, and validation of a computer-controlled physical device capable of taking any of a wide range of possible shapes in response to changes in a digital 3D model or to changes in the pressure exercised upon it by human hands. Although it clearly is a natural and unavoidable evolution of 3D graphical user interfaces, its unprecedented capabilities constitute a major leap in technologies and paradigms for 3D display, for 3D input, and for collaborative 3D design. In this paper, we provide an overview of the Digital Clay project and discuss the challenges, design choices, and initial solutions for a new Finger Sculpting interface designed for the Digital Clay and prototyped using conventional 3D I/O hardware.
Threshold selection by clustering gray levels of boundary.

A pacemaker working status telemonitoring algorithm.

Design and development of an interactive medical teleconsultation system over the World Wide Web.

A communication server for telemedicine applications.

